Halving Lines and Their Underlying Graphs
نویسندگان
چکیده
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
منابع مشابه
Sets of Points with Many Halving Lines
We used a genetic search algorithm to find sets of points with many halving lines. There are sets of 10 points with 13 halving lines, 12 points with 18 halving lines, 14 points with 22 halving lines, 16 points with 27 halving lines, and 18 points with 32 halving lines. We find a construction generalizing the 12 point configuration and show that, for any n = 3 · 2, there are configurations of n ...
متن کاملDense point sets with many halving lines
We construct a dense point set of n points in the plane with ne( √ logn) halving lines. This improves the bound O(n log n) of Edelsbrunner, Valtr and Welzl from 1997. We also observe that the upper bound on the maximum number of halving lines of dense point set can be improved to O(n). Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points...
متن کاملGeometric Dilation and Halving Distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کاملGeometric dilation and halving distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کاملar X iv : m at h . M G / 0 40 71 35 v 2 2 5 A ug 2 00 5 On the Geometric Dilation of Closed Curves , Graphs , and Point Sets ∗
Let G be an embedded planar graph whose edges are curves. The detour between two points p and q (on edges or vertices) of G is the ratio between the length of a shortest path connecting p and q in G and their Euclidean distance |pq|. The maximum detour over all pairs of points is called the geometric dilation δ(G). Ebbers-Baumann, Grüne and Klein have shown that every finite point set is contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.4959 شماره
صفحات -
تاریخ انتشار 2012